Compositional model checking of monadic least fixed point logic

Compositional model checking refers to reducing the problem of model checking some property of the whole system to the problem of model checking its components. In this paper, we investigate compositional approach for model checking monadic least fixed point logic on transition systems assembled from the components by using the H-sum and the fusion operator. 1 Research Area – Main Themes The main concern of my recently started PhD research is to investigate possible applications of suitable algorithmic methods of mathematical logic and (finite) model theory to the model checking technique [3] with a hope to obtain yet another tool to increase its feasibility. One particular theme I am currently working on is development of algorithms for solving the model checking problem for certain variants of fixed point logic by means of solving the corresponding model checking games, i.e. computing the participating players’ winning strategies [2]. Another theme of my research is use of compositional approach for solving the model checking problem, i.e. reducing the problem of model checking the whole system to the problem of model checking its constituents. This paper presents some of the obtained results related to this second theme.